priority structure

См. также в других словарях:

• Priority queue — A priority queue is an abstract data type in computer programming. It is exactly like a regular queue or stack data structure, but additionally, each element is associated with a priority . stack: elements are pulled in last in first out order (e …   Wikipedia

• Double-ended priority queue — Not to be confused with Double ended queue. A double ended priority queue (DEPQ)[1] is an abstract data type similar to a priority queue except that it allows for efficient removal of both the maximum and minimum element. It is a data structure… …   Wikipedia

• Heap (data structure) — This article is about the programming data structure. For the dynamic memory area, see Dynamic memory allocation. Example of a complete binary max heap In computer science, a heap is a specialized tree based data structure that satisfies the heap …   Wikipedia

• Relativity priority dispute — Albert Einstein presented the theories of Special Relativity and General Relativity in groundbreaking publications that either contained no formal references to previous literature, or referred only to a small number of his predecessors for… …   Wikipedia

• Queue (data structure) — A queue (pronounced /kjuː/) is a particular kind of collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position and… …   Wikipedia

• Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… …   Wikipedia

• Cahn–Ingold–Prelog priority rules — The Cahn–Ingold–Prelog priority rules, CIP system or CIP conventions are a set of rules used in organic chemistry to name the stereoisomers of a molecule. A molecule may contain any number of stereocenters and any number of double bonds, and each …   Wikipedia

• Hierarchial Cell structure — ( HCS ) used in mobile telecommunication means splitting of cells. This type of cell structure allows the network to effectively use the geographical area and serve an increasing population.The large cell (called a macro cell ) is rearranged to… …   Wikipedia

• Data structure — In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.[1][2] Different kinds of data structures are suited to different kinds of applications, and some are highly …   Wikipedia

• Container (data structure) — For the abstract notion of containers in Type theory, see Container (Type theory). In computer science, a container is a class, a data structure[1][2], or an abstract data type (ADT) whose instances are collections of other objects. In other… …   Wikipedia

• Search data structure — In computer science, a search data structure is any data structure that allows the efficient retrieval of specific items from a set of items, such as a specific record from a database. The simplest, most general, and least efficient search… …   Wikipedia